One of the issues of reliable performance in the power grid is the existence of electromechanical oscillations between interconnected generators. The number of generators participating in each electromechanical oscillation mode and the frequency oscillation depends on the structure and function of the power grid. In this paper, to improve the transient nature of the network and damping electromechanical fluctuations, a decentralized robust adaptive control method based on DYNAMIC PROGRAMMING has been used to design a stabilizing power system and a complementary static var compensator (SVC) controller. By applying a single line to ground fault in the network, the robustness of the designed control systems is demonstrated. Also, the simulation results of the method used in this paper are compared with controllers whose parameters are adjusted using the PSO algorithm. The simulation results show the superiority of the decentralized robust adaptive control method based on DYNAMIC PROGRAMMING for the stabilizing design of the power system and the complementary SVC controller. The performance of the control method is tested using the IEEE 16-machine, 68-bus, 5-area is verified with time domain simulation.

Computational DYNAMIC PROGRAMMING, while of some use for situations typically encountered in industrial and systems engineering, has proved to be of much greater significance in many areas of computer science. We review some of these applications here.

This paper introduces a stochastic DYNAMIC PROGRAMMING (SDP) model which considers water demand as a state variable. This model called uncertain demand SDP (UDSDP), is a developed form of variable demand-driven advanced models. In this model demand is converted from deterministic to stochastic form. At first, using available climatic data and methods of determination for evapotranspiration of crops for a region in Isfahan, Iran, the time series of irrigation demand is built. Subsequently, the statistical characteristic of this time series is calculated to incorporate demand uncertainty in optimization model.Optimal policies of UDSDP model are evaluated for Zayandeh-rud riverreservoir system in a real time simulation model. Reliability indices of this model is calculated and compared with the results of a deterministic demand optimization model. This comparison shows the ability and effectiveness of UDSDP model especially when the value of demand uncertainty is significant relative to other uncertainties in reservoir operation model.

A large number of algorithms have been developed for optimization of mining limits in open pit boundaries, however, little amount of research is available for underground cases. This is mostly due to variability of the underground mining methods, complexity of economic factors in underground mines and lack of acceptability of computer algorithms among the underground mine design practitioners. This paper presents a new algorithm to optimize ultimate stope geometry, using the DYNAMIC PROGRAMMING technique. The algorithm employs a conventional 20 economic block model, called the "primary model". The minimum stope height and length are imposed to the primary to construct intermediate and final models. The DYNAMIC PROGRAMMING algorithm is then applied on the final model to maximize the stope total net value. The task is performed through a recursive formula, which consists of two criteria. The proposed DYNAMIC PROGRAMMING algorithm is best suited for vein type orebodies using any type of underground mining methods.    

Portfolio selection has always been one of the important issues in the field of investment management, which discusses how to allocate an investor's capital to different assets and form an efficient portfolio. If the modeling assumptions for portfolio optimization is closer to the real world, the results will be more reliable. Considering single horizon for investment is not real and more investors are investing for more than one period to be able to revise their positions over time. Moreover, in the real world, data and parameters are always uncertain. Therefore, the development of multi-period portfolio optimization models is a basic requirement. In this paper, based on the portfolio theory, a new multi-period portfolio selection model is proposed, which contains transaction costs, liquidity constraints, threshold constraints, cardinality constraints and class constraints. Moreover, mean absolute deviation is used as a measure of risk and uncertainty of data is modeled with scenario tree. Also, in order to solve the proposed model, the DYNAMIC PROGRAMMING method has been used and finally, the model efficiency was tested using data for 5 stocks from Tehran Stock Exchange in a period of 1390 to 1394. In the proposed model, the effect of some factors such as boundary of decision variables and the number of assets in the portfolio is examined. The results indicate that the proposed model has a suitable performance and completely consistent with the theory.

Haplotype block portioning is one of the most important problems in computational biology and bioinformatics. In this paper a new efficient algorithm is presented for haplotype block partitioning based on haplotype diversity. The algorithm can be performed in polynomial time complexity with regard to the number of haplotypes and SNPs. Our algorithm is compared with the other well known algorithms. The obtained results show the efficiency and the better performance of our algorithm.